Mixed self-complementary and self-converse diagraphs

Self-complementary circulant graphs

Self-Complementary Hypergraphs

In this thesis, we survey the current research into self-complementary hypergraphs, and present several new results. We characterize the cycle type of the permutations on n elements with order equal to a power of 2 which are k-complementing. The k-complementing permutations map the edges of a k-uniform hypergraph to the edges of its complement. This yields a test to determine whether a finite p...

self-revision and third party revision in translation

اهمیت این پژوهش در آن بود که به گفت? بسیاری از پژوهشگرانِ حوز? بازبینی ترجمه، ادبیات موجود در این زمینه به لحاظ نظری و عملی چندان قوی نیست و بخش های موجود نیز برداشت مناسبی از این مرحل? فرایند ترجمه ندارند، اگرچه اخیراً توجه به آن به صورت نظام مند افزایش یافته است. در عین حال، پژوهش های موجود از یک سو بر دگربازبینی بیشتر از خودبازبینی تأکید دارند و از دیگر سو تنها به لحاظ نظری به این موضوع می پرد...

The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions

We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side 2n equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appears to be the first direct proof of this fact. The problem of finding such a proof was suggested b...

Regular self-complementary uniform hypergraphs

A k-uniform hypergraph with vertex set V and edge set E is called t-subset-regular if every t-element subset of V lies in the same number of elements of E. In this paper we establish a necessary condition on n for there to exist a t-subset-regular selfcomplementary k-uniform hypergraph with n vertices. In addition, we show that this necessary condition is also sufficient in the case k = 3 and t...